Logic Programming for Cellular Automata

Cellular automata can represent real-world phenomena studied in physics and biology, and have been applied to intelligent systems like artificial life and multi-agent systems. In this paper, we study a semantic preserving transformation between cellular automata and normal logic programs based on the TP -operator. In particular, a subset of normal logic programs is shown to precisely correspond to the classic grid-based cellular automata such as Conway’s Game of Life. We use two automaton models: one-way bounded cellular automata, for simplicity of construction, and unbounded cellular automata, which correspond to the classic definition of grid-based cellular automata. Using this construction, some computational theorems are easily proved regarding phenomena in the configurations of one-way bounded cellular automata, and some decidability results are newly obtained on the orbits of normal logic programs.